On minimum maximal independent sets of a graph
نویسندگان
چکیده
منابع مشابه
MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملOn the number of maximal independent sets in a graph
Let G be a (simple, undirected, finite) graph. A set S ⊆ V (G) is independent if no edge of G has both its endpoints in S. An independent set S is maximal if no independent set of G properly contains S. Let MIS(G) be the set of all maximal independent sets in G. Miller and Muller (1960) and Moon and Moser (1965) independently proved that the maximum, taken over all n-vertex graphs G, of |MIS(G)...
متن کاملMaximal independent sets in a generalisation of caterpillar graph
A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backbone to the pendant vertices are called the hairs of the caterpillar graph. Ortiz and Villanueva (C.Ortiz and M.Villanueva, Discrete Applied Mathematics, 160(3): 259-266, 2012) describe an algorithm, linear in the size...
متن کاملMaximal independent sets in the covering graph of the cube
Several familiar problems in extremal set theory can be cast as questions about the maximum possible size of an independent set defined on a suitable graph, about the total number of independent sets in such graphs, or about enumeration of the maximal independent sets. Here we find bounds on the number of maximal independent sets in the covering graph of a hypercube. © 2010 Elsevier B.V. All ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90318-v